Instantiation-Based Interpolation for Quantified Formulae in CSIsat
نویسندگان
چکیده
The paper describes an implementation of instantiation-based interpolation for quantified formulae in modified CSIsat tool. The tool supports interpolation for formulae with linear real arithmetic, uninterpreted functions and quantifiers. We propose in this paper using external SMT-solver CVC3 for quantified expressions instantiation, then we describe how we modified CSIsat and CVC3 tools in order to support quantified formulae interpolation. We also present results of benchmarking the modified CSIsat tool on SMTLIB test set as well as on our specially generated interpolation tasks.
منابع مشابه
Instantiation-Based Interpolation for Quantified Formulae
Interpolation has proven highly effective in program analysis and verification, e. g., to derive invariants or new abstractions. While interpolation for quantifier free formulae is understood quite well, it turns out to be challenging in the presence of quantifiers. We present in this paper modifications to instantiation based SMT-solvers and to McMillan’s interpolation algorithm in order to co...
متن کاملCSIsat: Interpolation for LA+EUF
We present CSIsat, an interpolating decision procedure for the quantifier-free theory of rational linear arithmetic and equality with uninterpreted function symbols. Our implementation combines the efficiency of linear programming for solving the arithmetic part with the efficiency of a SAT solver to reason about the boolean structure. We evaluate the efficiency of our tool on benchmarks from s...
متن کاملClassifying and Solving Horn Clauses for Verification
As a promising direction to overcome difficulties of verification, researchers have recently proposed the use of Horn constraints as intermediate representation. Horn constraints are related to Craig interpolation, which is one of the main techniques used to construct and refine abstractions in verification, and to synthesise inductive loop invariants. We give a classification of the different ...
متن کاملInstantiation Based First-Order Calculi PhD Qualifying Exam
This paper provides a survey over instantiation based calculi for first-order logic. This kind of calculus, which has the generation of instances of formulae at its core, has been neglected for a long period of time due to the success of resolution based methods. It has experienced a revival in interest in the last decade, as more efficient instantiation based calculi have been developed. After...
متن کاملBoolean Propagation Based on Literals for Quantified Boolean Formulae
This paper proposes a new set of propagation rules for quantified Boolean formulae based on literals and generated automatically thanks to quantified Boolean formulae certificates. Different decompositions by introduction of existentially quantified variables are discussed in order to construct complete systems. This set of rules is compared with already proposed quantified Boolean propagation ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012